reducible diagram

См. также в других словарях:

• приводимая диаграмма — (напр. к другому виду) [А.С.Гольдберг. Англо русский энергетический словарь. 2006 г.] Тематики энергетика в целом EN reducible diagram …   Справочник технического переводчика

• Computability theory — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown …   Wikipedia

• NP-complete — Euler diagram for P, NP, NP complete, and NP hard set of problems In computational complexity theory, the complexity class NP complete (abbreviated NP C or NPC) is a class of decision problems. A decision problem L is NP complete if it is in the… …   Wikipedia

• Heegaard splitting — In the mathematical field of geometric topology, a Heegaard splitting is a decomposition of a compact oriented 3 manifold that results from dividing it into two handlebodies. The importance of Heegaard splittings has grown in recent years as more …   Wikipedia

• Logicism — is one of the schools of thought in the philosophy of mathematics, putting forth the theory that mathematics is an extension of logic and therefore some or all mathematics is reducible to logic.[1] Bertrand Russell and Alfred North Whitehead… …   Wikipedia

• History of logic — Philosophy ( …   Wikipedia

• chemical bonding — ▪ chemistry Introduction       any of the interactions that account for the association of atoms into molecules, ions, crystals, and other stable species that make up the familiar substances of the everyday world. When atoms approach one another …   Universalium

• Semiotic elements and classes of signs — C. S. Peirce articles  General:    Charles Sanders Peirce Charles Sanders Peirce bibliography Philosophical:    Categories (Peirce) Semiotic elements and   classes of signs (Peirce) Pragmatic maxim • Pragmaticism… …   Wikipedia

• P versus NP problem — Unsolved problems in computer science Is P = NP ? …   Wikipedia

• Deligne–Lusztig theory — In mathematics, Deligne–Lusztig theory is a way of constructing linear representations of finite groups of Lie type using ℓ adic cohomology with compact support, introduced by Deligne Lusztig (1976). Lusztig (1984) used these representations to… …   Wikipedia

• metaphysics — /met euh fiz iks/, n. (used with a sing. v.) 1. the branch of philosophy that treats of first principles, includes ontology and cosmology, and is intimately connected with epistemology. 2. philosophy, esp. in its more abstruse branches. 3. the… …   Universalium